Search results

Hamming distance of a two bit strings u and v of length n is defined to be the number of positions of u and v with different digit. If G is a simple graph on n vertices and m edges and B is an edge–vertex incidence matrix of G, then every edge e of G can be labeled using a binary digit string of length n from the row of B which corresponds to the edge e. We discuss Hamming distance of two different edges of the graph G. Then, we present formulae for the sum of all Hamming distances between two different edges of G, particularly when G is a path, a cycle, and a wheel, and some composite graphs.